package Lee_code;

public class Lee_746 {
    public int minCostClimbingStairs(int[] cost)
    {
        int[] dp = new int[cost.length+1];
        dp[0] = 0;
        dp[1] = 0;
        for (int i=2; i<=cost.length+1; i++)
        {
            dp[i] = Math.min(cost[i-1], cost[i-2]);
        }
        return dp[cost.length+1];
    }
}
